Reduced Complexity Optimum Detector For Block Data Transmission System Using An Lattice Sphere Detection Technique
نویسندگان
چکیده
Block Data Transmission Systems (BDTS) are used in high speed wireless communication systems with time dispersive channel characteristics. Since Maximum Likelihood Block Detection (MLBD) requires huge amount of computation, Sphere Detection (SD) technique has been introduced as an alternative. This paper proposes an An Lattice Sphere Detection (AnLSD) technique for detection in block data transmission systems (BDTS). The An lattice structure offers more dense constellation points than the customary Zn lattice in SD technique. Thus, the proposed AnLSD uses An lattice generator matrix as the channel matrix, and uses the Gram matrix which is obtained from the generator matrix as part of the detection process. Simulation results show that the proposed AnLSD performs very close to the Exhaustive search (ES) using block size of 20 bits. It is also performing better than the other renowned methods tested under a channel with spectral nulls. The proposed AnLSD technique offers significant reduction in term of objective functions evaluation as compared to the other renowned methods. Index Terms Sphere Detection (SD), Lattice, Block Data Transmission Systems
منابع مشابه
1 3 A ug 2 00 5 Layered Orthogonal Lattice Detector for Two Transmit Antenna
A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it finds a reduced complexity solution to the problem of finding the closest vector to the received observations. The algorithm achieves optimal maximum-likelihood (ML) performance in case of two transmit antennas, at the same time keeping a c...
متن کاملA ug 2 00 5 Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications ∗
A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it finds a reduced complexity solution to the problem of finding the closest vector to the received observations. The algorithm achieves optimal maximum-likelihood (ML) performance in case of two transmit antennas, at the same time keeping a c...
متن کاملLayered Orthogonal Lattice Detector for Two Transmit Antenna Communications
A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it nds a reduced complexity solution to the problem of nding the closest vector to the received observations. The algorithm achieves optimal maximum-likelihood (ML) performance in case of two transmit antennas, at the same time keeping a compl...
متن کاملA novel soft information algorithm for closest point search in lattices with Tanner graph representations
An efficient, low-complexity, soft-information detector for multiple input multiple output channels and lattice constellations was devised, based on Tanner graph representations of lattices. Due to the coding gain associated with a lattice, structural relations exist between certain lattice points, which can be associated via an equivalence relation for detection purposes. The algorithm can gen...
متن کاملA Multiple Lattice Reduction Based Detector for Space Time Block Codes Based on Cyclotomic Extensions
Full diversity high-rate Space Time Block Codes (STBCs) based on cyclotomic field extensions Q(ωl), where ωl is the complex lth root of unity, can be decoded by Lenstra-Lenstra-Lovász (LLL) lattice reduction-aided linear equalization followed by appropriate zero forcing. LLL lattice reduction-aided linear equalization enables lower complexity decoding compared to sphere decoding, while resultin...
متن کامل